An Efficient Algorithm for Determining the k-error Linear Complexity of Binary Sequences with Periods 2p
نویسنده
چکیده
An efficient algorithm is presented for computing the kerror linear complexity of a binary sequence with period 2p, where 2 is a primitive root modulo p. The new algorithm is a generalization of an algorithm for computing the k-error linear complexity of a binary sequence with period p presented by Wei, Chen, and Xiao.
منابع مشابه
On the Second Descent Points for the K-Error Linear Complexity of 2-Periodic Binary Sequences
In this paper, a constructive approach for determining CELCS (critical error linear complexity spectrum) for the kerror linear complexity distribution of 2-periodic binary sequences is developed via the sieve method and Games-Chan algorithm. Accordingly, the second descent point (critical point) distribution of the k-error linear complexity for 2-periodic binary sequences is characterized. As a...
متن کاملFast Algorithms for Determining the Linear Complexity of Period Sequences
We introduce a fast algorithm for determining the linear complexity and the minimal polynomial of a sequence with period p over GF(q) , where p is an odd prime, q is a prime and a primitive root modulo p; and its two generalized algorithms. One is the algorithm for determining the linear complexity and the minimal polynomial of a sequence with period pq over GF(q), the other is the algorithm fo...
متن کاملAn Efficient Adaptive Boundary Matching Algorithm for Video Error Concealment
Sending compressed video data in error-prone environments (like the Internet and wireless networks) might cause data degradation. Error concealment techniques try to conceal the received data in the decoder side. In this paper, an adaptive boundary matching algorithm is presented for recovering the damaged motion vectors (MVs). This algorithm uses an outer boundary matching or directional tempo...
متن کاملar X iv : 1 10 8 . 57 93 v 1 [ cs . C R ] 3 0 A ug 2 01 1 The k - error linear complexity distribution for 2 n - periodic binary sequences
The linear complexity and the k-error linear complexity of a sequence have been used as important security measures for key stream sequence strength in linear feedback shift register design. By studying the linear complexity of binary sequences with period 2n, one could convert the computation of kerror linear complexity into finding error sequences with minimal Hamming weight. Based on Games-C...
متن کاملThe $$k$$ -error linear complexity distribution for $$2^n$$ -periodic binary sequences
The linear complexity and the k-error linear complexity of a sequence have been used as important security measures for key stream sequence strength in linear feedback shift register design. By studying the linear complexity of binary sequences with period 2n, one could convert the computation of kerror linear complexity into finding error sequences with minimal Hamming weight. Based on Games-C...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008